Skip to main content

BSTJ 60: 9. November 1981: McDonald's Problem - An Example of Using Dijkstra's Programming Method. (Sharma, D.K.)

Bookreader Item Preview

texts

BSTJ 60: 9. November 1981: McDonald's Problem - An Example of Using Dijkstra's Programming Method. (Sharma, D.K.)


Publication date
Topics
program, solution, file, sum, loop, sequentially, print, assertions, nth, initialization, mcdonalds problem, loop invariant, system technical, wider class, data structure, net change, food item, structure design, bell system, introduce file
Collection
bstj-archives; magazine_rack; sciencemagazines
Language
English
Item Size
6.7M
Bell System Technical Journal, 60: 9. November 1981 pp 2157-2165. McDonald's Problem - An Example of Using Dijkstra's Programming Method. (Sharma, D.K.)
Addeddate
2013-01-19 11:38:17
Identifier
bstj60-9-2157
Identifier-ark
ark:/13960/t3xs71p1f
Ocr
ABBYY FineReader 8.0
Ppi
200


comment
Reviews

313 Views

DOWNLOAD OPTIONS

download 1 file
ABBYY GZ download
DAISY

For users with print-disabilities

EPUB
download 1 file
FULL TEXT download
download 1 file
ITEM TILE download
download 1 file
PDF download
download 1 file
PDF WITH TEXT download
download 1 file
SINGLE PAGE PROCESSED JP2 ZIP download
download 1 file
TORRENT download
download 15 Files
download 7 Original
SHOW ALL

IN COLLECTIONS

The Bell System Technical Journal (1922-1983) The Magazine Rack Science and Scientific Magazines

Uploaded by Sketch the Cow on

SIMILAR ITEMS (based on metadata)

Terms of Service (last updated 12/31/2014)